Graph-combinatorial approach for large deviations of Markov chains

نویسندگان

چکیده

We consider discrete-time Markov chains and study large deviations of the pair empirical occupation measure, which is useful to compute fluctuations pure-additive jump-type observables. provide an exact expression for finite-time moment generating function, split in cycles paths contributions, scaled cumulant function measure via a graph-combinatorial approach. The obtained allows us give physical interpretation interaction entropic terms, Lagrange multipliers, may serve as starting point sub-leading asymptotics. illustrate use method simple two-state chain.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large Deviations for a Class of Nonhomogeneous Markov Chains

Large deviation results are given for a class of perturbed non-homogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {Pn} be a sequence of transition matrices on a finite state space which converge to a limit transition matrix P. Let {Xn} be the associated non-homogeneous Markov chain where Pn controls movement from ti...

متن کامل

Large deviations for a class of nonhomogeneous Markov chains: K-word level results

In previous work, Dietz and Sethuraman (2005), large deviations with respect to additive functionals were established for a class of finite-state time-nonhomogeneous Markov chains whose connecting transition matrices {Pn} converge to a general limit matrix P which includes some stochastic optimization algorithms. In this note, large deviations at the next level, that is with respect to K-word e...

متن کامل

Sample Path Large Deviations for a Class of Markov Chains Related to Disordered Mean Field Models

We prove a large deviation principle on path space for a class of discrete time Markov processes whose state space is the intersection of a regular domain Λ ⊂ R with some lattice of spacing ǫ. Transitions from x to y are allowed if ǫ−1(x−y) ∈ ∆ for some fixed set of vectors ∆. The transition probabilities pǫ(t, x, y), which themselves depend on ǫ, are allowed to depend on the starting point x a...

متن کامل

Large-deviations/thermodynamic approach to percolation on the complete graph

We present a large-deviations/thermodynamic approach to the classic problem of percolation on the complete graph. Specifically, we determine the large-deviation rate function for the probability that the giant component occupies a fixed fraction of the graph while all other components are “small.” One consequence is an immediate derivation of the “cavity” formula for the fraction of vertices in...

متن کامل

Taylor Expansion for the Entropy Rate of Hidden Markov Chains

We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A

سال: 2022

ISSN: ['1751-8113', '1751-8121']

DOI: https://doi.org/10.1088/1751-8121/ac79e6